Goto

Collaborating Authors

 Middlesex County







Instance-Optimal Private Density Estimation in the Wasserstein Distance

Neural Information Processing Systems

Estimating the density of a distribution from samples is a fundamental problem in statistics. In many practical settings, the Wasserstein distance is an appropriate error metric for density estimation. For example, when estimating population densities in a geographic region, a small Wasserstein distance means that the estimate is able to capture roughly where the population mass is. In this work we study differentially private density estimation in the Wasserstein distance. We design and analyze instance-optimal algorithms for this problem that can adapt to easy instances.


Prior-Free Dynamic Auctions with Low Regret Buyers

Yuan Deng, Jon Schneider, Balasubramanian Sivan

Neural Information Processing Systems

We study the problem of how to repeatedly sell to a buyer running a no-regret,mean-based algorithm. Previous work [Braverman et al., 2018] shows that it ispossible to design effective mechanisms in such a setting that extract almost allof the economic surplus, but these mechanisms require the buyer's values each



Sparsified SGD with Memory

Sebastian U. Stich, Jean-Baptiste Cordonnier, Martin Jaggi

Neural Information Processing Systems

Several papers consider approaches that limit the number of bits to represent floating point numbers [13, 24, 31]. Recent work proposes adaptive tuning of the compression ratio [7].